University Buses Routing and Tracking System
نویسندگان
چکیده
منابع مشابه
Randomized Routing on Meshes with Buses
We give algorithms and lower bounds for the problem of routing k-permutations on d-dimensional MIMD meshes with additional buses. A straightforward argument shows that for all d 1, 2=3 n steps are required for routing permutations (the case k = 1) on a d-dimensional mesh. We prove that routing permutations on d-dimensional meshes requires at least (1 ? 1=d) n steps. For small d better lower bou...
متن کاملRouting with Locality on Meshes with Buses
a d 1 O(d/f(d)) step, O( f(d)) buffer size routing algorithm which is asymptotically optimal if f(d) is chosen to be a large constant. In our study, we assume all the processors operate in synchronous MIMD mode. At any time step, each processor can communicate with all of its grid neighbors and can both send and receive one packet along each mesh link. In addition, processors can also store pac...
متن کاملRouting and Sorting on Meshes with Row and Column Buses
We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...
متن کاملThe Rockefeller University Graduate Tracking Survey System
BACKGROUND It is essential to track the careers and accomplishments of the graduates of translational research training programs to assess the impact of the programs and to improve them. The major obstacle is the lack of a convenient method to collect the information in a comprehensive and standardized manner. METHODS We have developed a Web-based electronic Graduate Tracking Survey System (G...
متن کاملInteger Sorting and Routing in Arrays with Reconfigurable Optical Buses
In this paper we present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconngurable optical buses. The main objective is to identify the mechanisms speciic to this type of architectures that allow us to build eecient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on the PRAM simulation complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science and Information Technology
سال: 2017
ISSN: 0975-4660,0975-3826
DOI: 10.5121/ijcsit.2017.9108